Formal Veri cation of Arbitrary Network Topologies
نویسنده
چکیده
We show how data independence results can be used to generalise an inductive proof from binary to arbitrary branching tree networks. The example used is modelled on the RSVP Resource Reservation Protocol. Of particular interest is the need for a separate lower-level induction which is itself closely tied to data independence. The inductions combine the use of the process algebra CSP to model systems and their speciications, and the FDR tool to discharge the various proof obligations.
منابع مشابه
The Formal Veriication of an Atm Network 1
Communication networks are rapidly becoming all pervasive. As this occurs, the consequences of errors in the design or implementation of network components becomes increasingly important. This is especially so if, as is increasingly probable, networks are used in safety-critical applications where communication problems could cause loss of life. Asynchronous Transfer Mode (ATM) is a relatively ...
متن کاملA Formally Veri ed Algorithm for Clock Synchronization Under a Hybrid Fault Model
A small modi cation to the interactive convergence clock synchronization algorithm allows it to tolerate a larger number of simple faults than the standard algorithm, without reducing its ability to tolerate arbitrary or \Byzantine" faults. Because the extended caseanalysis required by the new fault model complicates the already intricate argument for correctness of the algorithm, it has been s...
متن کاملVerifying End-to-End Protocols using Induction with CSP/FDR
We investigate a technique, suitable for process algebraic, nite-state machine (model-checking) automated tools, for formally modelling arbitrary network topologies. We model aspects of a protocol for multiservice networks, and demonstrate how the technique can be used to verify end-to-end properties of protocols designed for arbitrary numbers of intermediate nodes. Our models are presented in ...
متن کاملByte Code Verification for Java Smart Card Based on Model Checking
The paper presents a novel approach to Java byte code veri cation: The veri cation process is performed \o ine" on a network server, instead of incorporating it in the client. Furthermore, the most critical part of the veri cation process is based upon a formal model and uses a model checker for checking the veri cation conditions. The result of the veri cation process can be securely communica...
متن کاملTracking Design Changes with Formal Machine - Checked Proof
Designs are often modi ed for use in new circumstances. If formal proof is to be an acceptable veri cation methodology for industry, it must be capable of tracking design changes quickly. We describe our experiences formally verifying an implementation of an ATM network component, and on our subsequent veri cation of modi ed designs. Three of the designs veri ed are in use in a working network....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999